4-th Ieee International Conference on Peer-to-peer Computing 100 Million Dht Replies
نویسنده
چکیده
Crawling a DHT allows researchers to monitor the behaviour of peers, determine their geographic location, etc. However, it has always been an error-prone process as it is not feasible to capture a full snapshot of the Mainline DHT in a timely manner. Therefore, researchers have developed approximation methods which can run on subsets of the DHT and extrapolate those in order to reason on the size and structure of the complete DHT. However, in this paper we introduce a new method of collecting information on peers connected to a DHT. We exploit the caches present at bootstrap servers to collect information on peers which are currently connected. Originally added to the bootstrap servers in order to be able to withstand more than 20,000 requests for peers each second, we now use the same mechanism as peers bootstrapping into the DHT to discover more than 20 Million peers in less than 2 hours. Using the bootstrap servers, we discover more than twice as many peers as BitMon, which crawls a subset of the DHT and then extrapolates. Moreover, in contrast to related work which often require highly customized/tuned BitTorrent clients, our script consists of 90 lines of Python code and runs on a simple laptop.
منابع مشابه
XEvent: An Event Notification System over Distributed Hash Table (DHT) Networks
IEEE Intelligent Informatics Bulletin November 2005 Vol.6 No.2 Abstract—In this paper, we propose a novel event notification system, named as XEvent. The system is built over a Distributed Hash Table (DHT)-based Peer-to-Peer (P2P) system by combining a content-based system with a specific event topic. XEvent can support basic topic-based message subscription by use of XML schema as event topic,...
متن کاملStructured Peer-to-Peer Networks: Faster, Closer, Smarter
Peer-to-peer (P2P) distributed hash tables (DHTs) are structured networks with decentralized lookup capabilities. Each node is responsible for a given set of keys (identifiers) and lookup of a key is achieved by routing a request through the network toward the current peer responsible for the desired key. DHT designs are usually compared in terms of degree (number of neighbors) and diameter (le...
متن کاملDual Channel Transmission for Coexistence of Wireless Networks
With the upcoming pervasive deployment of wireless networks and devices on the unlicensed band, co-channel interference caused by frequency collisions among coexisting networks have become one of the major performance limiting challenges. In recent years the coexistence issue has gained increasing attention. However, many collision avoidance schemes are not applicable to multiple frequency hopp...
متن کاملDual Channel Transmission for Coexistence of Wireless Networks Report Title
With the upcoming pervasive deployment of wireless networks and devices on the unlicensed band, co-channel interference caused by frequency collisions among coexisting networks have become one of the major performance limiting challenges. In recent years the coexistence issue has gained increasing attention. However, many collision avoidance schemes are not applicable to multiple frequency hopp...
متن کاملUlysses: A Robust, Low-Diameter, Low-Latency Peer-ti-Peer Network
A number of Distributed Hash Table (DHT)-based protocols have been proposed to address the issue of scalability in peer-topeer networks. However, it remains an open question whether there exists a DHT scheme that can achieve the theoretical lower bound of on network diameter when the average routing table size at nodes is no more than . In this paper, we present Ulysses, a peer-to-peer network ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014